A Gradient Bound for the Grad-Kruskal-Kulsrud Functional

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An upper bound to the second Hankel functional for the class of gamma-starlike functions

‎The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$‎ ‎for the function $f$‎, ‎belonging to the class of Gamma-starlike functions‎, ‎using Toeplitz determinants‎. ‎The result presented here include‎ ‎two known results as their special cases‎.  

متن کامل

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

متن کامل

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

A unified convergence bound for conjugate gradient and accelerated gradient∗

Nesterov’s accelerated gradient method for minimizing a smooth strongly convex function f is known to reduce f(xk) − f(x∗) by a factor of ∈ (0, 1) after k ≥ O( √ L/` log(1/ )) iterations, where `, L are the two parameters of smooth strong convexity. Furthermore, it is known that this is the best possible complexity in the function-gradient oracle model of computation. The method of linear conju...

متن کامل

A Kruskal - Katona Type Theorem for the

We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG (n; 2) ordered by inclusion. For given k; ` (k < `) and m the problem is to nd a family of size m in the set of`-subspaces of PG (n; 2), containing the minimal number of k-subspaces. We introduce two lexicographic type orders O 1 and O 2 on the set of`-subspaces, and prove that the rst m of them, take...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Research Letters

سال: 1994

ISSN: 1073-2780,1945-001X

DOI: 10.4310/mrl.1994.v1.n3.a9